Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees
نویسندگان
چکیده
منابع مشابه
On the Relationship between Linear Programming Decoding and Min-Sum Algorithm Decoding
We are interested in the characterization of the decision regions when decoding a low-density parity-check code with the min-sum algorithm. Observations made in [1] and experimental evidence suggest that these decision regions are tightly related to the decision regions obtained when decoding the code with the linear programming decoder. We introduce a family of quadratic programming decoders t...
متن کاملIMPLEMENTATION OF LDPC USING MIN - SUM DECODING ALGORITHM Maheshwari
In storage system Low-density parity-check (LDPC) codes are used because the performance of error correction is very close to Shannon limit for large block lengths. In this paper LDPC decoder using min-sum algorithm is proposed. The inter-connect complexity is reduced by restricting the extrinsic message length to 2 bits and also simplifies the check node operation by this decoder. The increase...
متن کاملAlgebraic Dynamic Programming on Trees
Where string grammars describe how to generate and parse strings, tree grammars describe how to generate and parse trees. We show how to extend generalized algebraic dynamic programming to tree grammars. The resulting dynamic programming algorithms are efficient and provide the complete feature set available to string grammars, including automatic generation of outside parsers and algebra produ...
متن کاملLDPC Code Design for Min-Sum Based Decoding
We consider the problem of designing low-density parity-check (LDPC) codes for min-sum decoding. We wish to find the LDPC ensemble with the best asymptotic performance. In [1], [2], Amraoui and Urbanke proposed an optimization scheme where a combination of density evolution and extrinsic information transfer (EXIT) charts is used to design LDPC codes for the belief propagation decoding algorith...
متن کاملAccelerated consensus via Min-Sum Splitting
•Common choice is Metropolis-Hastings: W M H i j = { 1/(2dmax) if {i , j } ∈ E 1−di /(2dmax) if i = j 0 otherwise •Rate of convergence is controlled by ρ(W −11T /n). • min{ρ(W −11T /n) : W symmetrical} is a convex problem (SDP). •Optimal matrix yields slow rate O(D2), achieved by W M H . •Lower-bound: Ω(D), where D is graph diameter. •To get fast rates, two approaches have been developed indepe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2290303